Randomized assignment of jobs to servers in heterogeneous clusters of shared servers for low delay
نویسندگان
چکیده
منابع مشابه
Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay
We consider the job assignment problem in a multi-server system consisting of N parallel processor sharing servers, categorized into M (≪ N) different types according to their processing capacity or speed. Jobs of random sizes arrive at the system according to a Poisson process with rate Nλ. Upon each arrival, a small number of servers from each type is sampled uniformly at random. The job is t...
متن کاملOn the static assignment to parallel servers
We study the static assignment to M parallel, exponential, heterogeneous servers. Blocked customers are lost, while the objective is to minimize the average number of blocked customers. The problem is formulated as a stochastic control problem with partial observation, and an equivalent full observation problem is formulated. Numerical experiments are conducted and the structure of the optimal ...
متن کاملOptimal Routing of Fixed Size Jobs to Two Parallel Servers
We consider a heterogeneous two-server system processing fixed size jobs. This includes the scheduling system, where jobs wait in a common queue, and the dispatching system, where jobs are assigned to server-specific queues upon arrival. The optimal policy with respect to the delay in both systems is a threshold policy characterized by a single parameter. In this special case, the scheduling an...
متن کاملVacation model for Markov machine repair problem with two heterogeneous unreliable servers and threshold recovery
Markov model of multi-component machining system comprising two unreliable heterogeneous servers and mixed type of standby support has been studied. The repair job of broken down machines is done on the basis of bi-level threshold policy for the activation of the servers. The server returns back to render repair job when the pre-specified workload of failed machines is build up. The first (seco...
متن کاملminimizing loss probability in queuing systems with heterogeneous servers
the probability of losing a customer in m/g/n/0 and gi/m/n/0 loss queuing systems withheterogeneous servers is minimized. the first system uses a queue discipline in which a customer who arriveswhen there are free servers chooses any one of them with equal probability, but is lost otherwise. providedthat the sum of the servers rates are fixed, loss probability in this system attains minimum val...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Systems
سال: 2016
ISSN: 1946-5238
DOI: 10.1214/15-ssy179